Modification of Edmonds ' Maximum Matching Algorithm
نویسنده
چکیده
Edmonds d e veloped an efficient a lgorithm for finding in a given graph C a mat c hing of maximum cardinality. Thi s algorithm "s hrinks" part s of the graph C. Although helpful to the intuitive unde rstanding of the theory, s hrinking is compl icated to im plem e nt on an e l<!'c troni c comput e rThe modificati on presente d in thi s paper avoids s hrinking_ It e mploys ins tead a treelik e arrangement of alt e rnating paths. The possibili t y of s uc h an arrangement is also of theo re ti ca l int e res t , and it s proof form s the main part of th e paper-
منابع مشابه
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited
We reduce the problem of finding an augmenting path in a general graph to a reachability problem in a directed bipartite graph. A slight modification of depth-first search leads to an algorithm for finding such paths. Although this setting is equivalent to the traditional terminology of blossoms due to Edmonds, there are some advantages. Mainly, this point of view enables the description of alg...
متن کاملMaximum Matching in General Graphs Without Explicit Consideration of Blossoms
We reduce the problem of nding an augmenting path in a general graph to a reachability problem in a directed, bipartite graph. Furthermore , we show that a slight modiication of depth-rst search leads to an algorithm for nding such paths. This new point of view enables us to develop algorithms for the solution of matching problems without explicit analysis of blossoms, nested blossoms, a.s.o. A...
متن کاملLecture notes for “Analysis of Algorithms”: Maximum matching in general graphs
We present Edmonds’ blossom shrinking algorithm for finding a maximum cardinality matching in a general graph. En route, we obtain an efficient algorithm for finding a minimum vertex cover in a bipartite graph and show that its size is equal to the size of the maximum matching in the graph. We also show that the size of a maximum matching in a general graph is equal to the size of a minimum odd...
متن کاملLocal recoding by maximum weight matching for disclosure control of microdata sets
We propose “local recoding” as a new technique for controlling disclosure risk of microdata sets. Compared to the technique of global recoding, where the observed values are grouped into broader intervals or categories throughout the data set, in local recoding different grouping is performed for each observation when necessary. As a means of performing local recoding we propose to form pairs o...
متن کاملMaximum Matching in Nonbipartite Graphs Without Explicit Consideration of Blossoms
We reduce the problem of nding an augmenting path in a nonbipar-tite graph to a reachability problem in a directed, bipartite graph. Furthermore, we show that a slight modiication of depth-rst search leads to an algorithm for nding such paths. This new point of view enables us to develop algorithms for the solution of matching problems without explicit consideration of blossoms, nested blossoms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1965